This note deals with the evaluation of blocking probabilities in a finite capacity multiseveer queue with non-preemptive priorities. Results obtained in Kapadia, Kazmi and Mitchell are simplified and extended
This paper deals with the evaluation of blocking probabilities in a finite capacity non-preemptive priority queue. An essential role in the analysis is played by the observation that Poisson arrivals see time averages